Automated Positive Part Extraction for Lattice Path Generating Functions in the Octant
نویسندگان
چکیده
منابع مشابه
On 3-dimensional Lattice Walks Confined to the Positive Octant
Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in {0,±1}2: the generating function is D-finite if and only if a certain group associated with the step set is finite. We explore in this paper the analogous problem for 3-dimensional walks confined to the positive o...
متن کاملRational Generating Functions for Lattice Point Problems
We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice points, notably integer semigroups and (minimal) Hilbert bases of rational cones, have short rational generating functions provided certain parameters (the ...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملLattice walks in the octant with infinite associated groups
Continuing earlier investigations of restricted lattice walks in N3, we take a closer look at the models with infinite associated groups. We find that up to isomorphism, only 12 different infinite groups appear, and we establish a connection between the group of a model and the model being Hadamard.
متن کاملGenerating functions for the area below some lattice paths
In this paper we consider a model of random walks previously studied in [BM02]: each walk starts (at time 0) from a point p0 of and at time n, one makes a jump xn ; the new position is given by the recurrence pn pn 1 xn where, when pn 1 k, the xn’s are constrained to belong to a fixed set Pk (that is, the possible jumps depend on the position of the walk). We call paths on the walks under this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2017
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.07.073